WAITING TIME DISTRIBUTION IN THE M/M/M RETRIAL QUEUE
نویسندگان
چکیده
منابع مشابه
Tail Asymptotics for the Waiting Time in an M/g/1 Retrial Queue
We consider an M/G/1 retrial queue, where the service time distribution has a regularly varying tail with index −β, 1 < β < 2. It is shown that the waiting time distribution has a regularly varying tail with index 1− β, and the pre-factor is determined explicitly. The result is obtained by comparing the waiting time in the M/G/1 retrial queue with the waiting time in the ordinary M/G/1 queue wi...
متن کاملThe Waiting Time Distribution for theM=M=m Queue
This paper presents a novel method for the calculation of the waiting time distribution function for the M=M=m queue. It is shown that the conditional waiting time obeys an Erlang distribution with rate m , where is the service rate of a server. Explicit closed form solution is obtained by means of the probability density function of the Erlang distribution. It turns out that the derivation of ...
متن کاملSTATIONARY WAITING TIME DISTRIBUTION IN A GI/Ek/m QUEUE
STATIONARY WAITING TIME DISTRIBUTION IN A GI/Ek/m QUEUE Akihiko Ishikawa Science University of Tokyo (Received May 21, 1983: Final February 17, 1984) In this paper, the stationary waiting time distributions Fq (x) and F (x) are explicitly formulated for the GI/Ek/m queue under the first-come first-served discipline. The transition probability matrix and the imbedded probabilities play the impor...
متن کاملApproximations for the waiting - time distribution in an M / P H / c priority queue
We investigate the use of priority mechanisms when assigning service engineers to customers as a tool for service differentiation. To this end, we analyze a nonpreemptive M/P H/c priority queue with various customer classes. For this queue, we present various accurate and fast methods to estimate the first two moments of the waiting time per class given that all servers are occupied. These wait...
متن کاملApproximations for the waiting time distribution in an M/G/c priority queue
We investigate the use of priority mechanisms when assigning service engineers to customers as a tool for service differentiation. To this end, we analyze a non-preemptive M/G/c priority queue with various customer classes. For this queue, we present various accurate and fast methods to estimate the first two moments of the waiting time per class given that all servers are occupied. These waiti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Korean Mathematical Society
سال: 2013
ISSN: 1015-8634
DOI: 10.4134/bkms.2013.50.5.1659